Finite Automata in the Automatic Teller Machine Test Program Design

The Formal Design Model of an Automatic Teller Machine (ATM)

An Automated Teller Machine (ATM) is a safety-critical and real-time system that is highly complicated in design and implementation. This paper presents the formal design, specification, and modeling of the ATM system using a denotational mathematics known as Real-Time Process Algebra (RTPA). The conceptual model of the ATM system is introduced as the initial requirements for the system. The ar...

The Formal Design Model of an Automatic Teller Machine (ATM)

Automated teller machines (ATM) have become a part and parcel of supermarkets, convenience stores, travel centers and banking. ATM is a real-time system that is very complex in design and application. This paper presents the formal design, requirement, a distributed approach for the ATM networks, and type of the ATM system. 

Automatic Design of Cellular Automata for Generating Deterministic Test Patterns

The paper presents implementation of a test pattern generation technique that uses cellular automaton construction based on the analysis of a pre-computed test set. The algorithm is included into the Java applet for automatic synthesis of the built-in self-test structure into a digital circuit modeled in VHDL.

Program Analysis through Finite Tree Automata

Dynamic Pushdown Networks (dpn’s) have recently been introduced as a convenient abstraction of systems which provide recursive procedure calls and spawning of concurrent tasks such as Java programs [1, 4–6]. We show how the executions of dpn’s can naturally be represented through ranked trees. The configuration reached by a program execution then can be read off from the sequence of leaves of t...

Digital Design Automation Finite State Machine Design